---
title: "L1-085 试试手气"
created: 2025-11-28
tags:
  - 算法
---

# L1-085 试试手气

## 题目 [L1-085 试试手气](https://pintia.cn/problem-sets/994805046380707840/exam/problems/type/7?problemSetProblemId=1518581694528933888&page=0)

![[image-51d4d929.png]]

## 思路分析

## 代码实现

```cpp
#include<bits/stdc++.h>

using namespace std;

#define endl '\n'

using ll = long long;

using ull = unsigned long long;

using PII = pair<int,int>;

using Pll = pair<ll,ll>;

int dx[4]= {-1,0,1,0},dy[4]= {0,1,0,-1};

const int inf = 0x3f3f3f3f;

const int N=10;

vector<set<int>> a(6);

vector<int> ans;

int main() {

	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

	vector<int> initial(6);

	for (int i = 0; i < 6; ++i) {

		cin >> initial[i];

	}

	int n;

	cin >> n;

	vector<int> ans(6);

	for (int i = 0; i < 6; ++i) {

		unordered_set<int> used;

		used.insert(initial[i]);

		int current = 0;

		for (int j = 0; j < n; ++j) {

			for (int k = 6; k >= 1; --k) {

				if (used.find(k) == used.end()) {

					current = k;

				0- .,	break;

				}

			}

			used.insert(current);

		}

		an s[i] = current;

	}

	for (int i = 0; i < 6; ++i) {

		if (i > 0) cout << " ";

		cout << ans[i];

	}

	return 0;

}
```

## 同类题型

## 视频讲解

---
⬅️ [[L1-084 拯救外星人|L1-084 拯救外星人]] 🏠 [[00-天梯赛]] ➡️ [[L1-086 斯德哥尔摩火车上的题|L1-086 斯德哥尔摩火车上的题]]